Resource-monotonicity for house allocation problems
نویسندگان
چکیده
We study a simple model of assigning indivisible objects (e.g., houses, jobs, offices, etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We completely describe all rules satisfying efficiency, independence of irrelevant objects, and resource-monotonicity. The characterized rules assign the objects in a sequence of steps such that at each step there is either a dictator or two agents “trade” objects from their hierarchically specified “endowments.” JEL Classification: D63, D70
منابع مشابه
Corrigendum to "Resource-monotonicity for house allocation problems"
Ehlers and Klaus (2003) study so-called house allocation problems and claim to characterize all rules satisfying efficiency, independence of irrelevant objects, and resource-monotonicity on two preference domains (Ehlers and Klaus, 2003, Theorem 1). They explicitly prove Theorem 1 for preference domain R0 which requires that the null object is always the worst object and mention that the corres...
متن کاملObject allocation via deferred-acceptance: Strategy-proofness and comparative statics
We study the problem of assigning indivisible and heterogenous objects (e.g., houses, jobs, offices, school or university admissions etc.) to agents. Each agent receives at most one object and monetary compensations are not possible. We consider mechanisms satisfying a set of basic properties (unavailable-type-invariance, individual-rationality, weak non-wastefulness, or truncation-invariance)....
متن کاملThe ‘Boston’ School Choice Mechanism
The Boston mechanism is a popular student placement mechanism in school choice programs around the world. We provide two characterizations of the Boston mechanisms. We introduce two new axioms, respect of preference rankings and rank-respecting Maskin monotonicity. A mechanism is the Boston mechanism for some priority if and only if it respects preference rankings and satisfies consistency, res...
متن کاملConsistency and Unanimity in the House Allocation Problems I: Collective Initial Endowments
This paper studies allocation correspondences in the house allocation problems with collective initial endowments. We examine the implications of two axioms, namely “consistency” and “unanimity.” Consistency requires the allocation correspondence be invariant under reductions of population. Unanimity requires the allocation correspondence respect unanimity, that is, it assigns to every agent th...
متن کاملConstrained allocation problems with single-peaked preferences: An axiomatic analysis
We introduce a new class of problems that contains two existing classes: allocation problems with single-peaked preferences and bankruptcy problems. On this class, we analyze the implications of well-known properties such as Pareto optimality, strategy-proofness, resource-monotonicity, no-envy, equal treatment of equals, and two new properties we introduce, hierarchical no-envy and independence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 32 شماره
صفحات -
تاریخ انتشار 2004